An Effective Memetic Algorithm for Solving Channel Routing Problems

The task of VLSI physical design is to produce the layout of an integrated circuit. The layout problem in VLSI-design can be broken up into the subtasks partitioning, floor p lanning, placement and routing. Routing can be classified into two types. One is Global routing and another one is detailed routing. In detailed routing, the Connections between blocks or cells, respectively, have to be generated under consideration of certain constraints, e.g., different Nets are not allowed to intersect because such intersections produce short circuits. As routing is NP-complete, in general it cannot be solved exactly within reasonable time bounds for large Problem instances. Some problems are arises during the routing process .The routing constraints are Minimize total wire length, Minimize knees in path, Meet timing budget. To overcome these problems Memetic algorithm has been used. Combining global and local search is a strategy used by many successful hybrid optimization approaches. Memetic Algorithms (MAs) are Evolutionary Algorithms (EAs) that apply some sort of local search to further improve the fitness of individuals in the population. Memetic Algorithms have been shown to be very effective in solving many hard combinatorial optimization problems. This algorithm combines Genetic Algorithms and advanced local search to solve VLSI circuit Routing. The effect of local search, clustering and good initial solution on the overall Memetic algorithm by using the circuit routing as a paradigm.